#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
#define rep(i, a, b) for (int i = (a); i <= (b); i++)
#define per(i, a, b) for (int i = (a); i >= (b); i--)
#define endl '\n'
const int N = 2e5 + 5;

int n, m;
ll sum1, sum2;
struct Node {
  int x, y;
} a[N];

void solve() {
  cin >> n;
  rep(i, 1, n * 2 - 1) cin >> a[i].x >> a[i].y;
  sum1 = sum2 = 0;
  rep(i, 1, n * 2 - 1) sum1 += a[i].x, sum2 += a[i].y;
  rep(i, 1, n)
  return;
}
int main() {
  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  int t;
  cin >> t;
  while (t--) solve();
  return 0;
}